Rumor source detection for rumor spreading on random increasing trees
نویسندگان
چکیده
منابع مشابه
Rumor Source Detection for Rumor Spreading on Random Increasing Trees
In a recent paper, Shah and Zaman proposed the rumor center as an effective rumor source estimator for rumor spreading on random graphs. They proved for a very general random tree model that the detection probability remains positive as the number of nodes to which the rumor has spread tends to infinity. Moreover, they derived explicit asymptotic formulas for the detection probability of random...
متن کاملRumor Source Obfuscation on Irregular Trees
Anonymous messaging applications have recently gained popularity as a means for sharing opinions without fear of judgment or repercussion. These messages propagate anonymously over a network, typically defined by social connections or physical proximity. However, recent advances in rumor source detection show that the source of such an anonymous message can be inferred by certain statistical in...
متن کاملFinding Rumor Sources on Random Trees
We consider the problem of detecting the source of a rumor which has spread in a network using only observations about which set of nodes are infected with the rumor and with no information as to when these nodes became infected. In a recent work (Shah and Zaman 2010) this rumor source detection problem was introduced and studied. The authors proposed the graph score function rumor centrality a...
متن کاملRumor Spreading in Random Evolving Graphs
Randomized gossip is one of the most popular way of disseminating information in large scale networks. This method is appreciated for its simplicity, robustness, and efficiency. In the Push protocol, every informed node selects, at every time step (a.k.a. round), one of its neighboring node uniformly at random and forwards the information to this node. This protocol is known to complete informa...
متن کاملRumor Spreading on Percolation Graphs
We study the relation between the performance of the randomized rumor spreading (push model) in a d-regular graph G and the performance of the same algorithm in the percolated graph Gp. We show that if the push model successfully broadcast the rumor within T rounds in the graph G then only (1 + ǫ)T rounds are needed to spread the rumor in the graph Gp when T = o (pd).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2015
ISSN: 1083-589X
DOI: 10.1214/ecp.v20-3743